همگرایی مجانبی بعضی از روشهای ابتکاری زمان بندی کارگاه جریانی

heuristics are often used to provide solutions for flow shop scheduling problems.the performance of a heuristic is usually judged by comparing solutions and run times on test cases.this investigation proposes an analytical alternative ,called asymptotic convergence ,which tests the convergence of the heuristic to a lower bound as problem size grows. the test is a stronger variation of worst case performance analysis and is applied to heuristics for both the flow shop makespan and maximum tardiness problems.results show that fcfs ]first come first served[based heuristics meet the test.how the test should be applied in minizing flow shop makespane problem is discussed.